Games with Winning Conditions of High Borel Complexity
نویسنده
چکیده
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity. From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs. The problem of deciding the winner for these conditions is shown to be non-elementary.
منابع مشابه
On Winning Conditions of High Borel Complexity in Pushdown Games
In a recent paper [19, 20] Serre has presented some decidable winning conditions ΩA1B...BAnBAn+1 of arbitrarily high finite Borel complexity for games on finite graphs or on pushdown graphs. We answer in this paper several questions which were raised by Serre in [19, 20]. We study classes Cn(A), defined in [20], and show that these classes are included in the class of non-ambiguous context free...
متن کاملWhat are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
We investigate determinacy of delay games with Borel winning conditions, infinite-duration twoplayer games in which one player may delay her moves to obtain a lookahead on her opponent’s moves. First, we prove determinacy of such games with respect to a fixed evolution of the lookahead. However, strategies in such games may depend on information about the evolution. Thus, we introduce different...
متن کاملWeihrauch Degrees of Finding Equilibria in Sequential Games
We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winning sets (or more generally, outcome sets). In particular, we show that as the complexity of the winning sets increases in the difference hierarchy, the complexity of constructing winning strategies increases in the eff...
متن کاملFrom winning strategy to Nash equilibrium
Game theory is usually considered applied mathematics, but a few game-theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e. the existence of a winning strategy in games that involve two players and two outcomes saying who wins. In a multi-outcome setting, the notion of winning strategy is ir...
متن کاملBorel Determinacy of Concurrent Games
Just as traditional games can be represented by trees, so concurrent games can be represented by event structures. We show the determinacy of such concurrent games with Borel sets of configurations as winning conditions, provided they are race-free and bounded-concurrent. Both properties are shown necessary. The determinacy proof proceeds via a reduction to the determinacy of tree games, and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 350 شماره
صفحات -
تاریخ انتشار 2004